A lower bound technique for radio k-coloring
نویسندگان
چکیده
منابع مشابه
A Lower Bound for Radio Broadcast
A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors, where a processor receives a message in a given step if and only if it is silent in this step and precisely one of its neighbors transmits. In this paper we prove the existence of a family of radius-2 networks on n vertices for which any broadcast schedule requires at least sZ(lo...
متن کاملA Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
Suppose that n processors are arranged in a ring and can communicate only with their immediate neighbors. We show that any probabilistic algorithm for 3 coloring the ring must take at least 1 2 log n 2 rounds, otherwise the probability that all processors are colored legally is less than 1 2 . A similar time bound holds for selecting a maximal independent set. The bound is tight (up to a consta...
متن کامل1 Lower Bound on Coloring Rooted Trees
Definition 1. (The LOCAL model) We consider an arbitrary n-node graph G = (V,E) where V = {1, 2, . . . , n}, which abstracts the communication network. Unless noted otherwise, G is a simple, undirected, and unweighted graph. There is one process on each node v ∈ V of the network. At the beginning, the processes do not know the graph G, except for knowing n, and their own unique identifier in {1...
متن کاملLower Bound on Coloring Rooted Trees
Definition 1. (The LOCAL model) We consider an arbitrary n-node graph G = (V,E) where V = {1, 2, . . . , n}, which abstracts the communication network. Unless noted otherwise, G is a simple, undirected, and unweighted graph. There is one process on each node v ∈ V of the network. At the beginning, the processes do not know the graph G, except for knowing n, and their own unique identifier in {1...
متن کاملLower bound technique for length-reducing automata
The class of growing context-sensitive languages (GCSL) was proposed as a naturally defined subclass of contextsensitive languages whose membership problem is solvable in polynomial time. Growing context-sensitive languages and their deterministic counterpart calledChurch–Rosser languages (CRL) complement theChomskyhierarchy in a naturalway, as the classes filling the gap between context-free l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.12.021